#define _CRT_SECURE_NO_WARNINGS 1
class Solution {
public:
    int uniquePaths(int m, int n) {
        vector<vector<int>>dp(m, vector<int>(n));
        for (int i = 0; i < n; i++)
        {
            dp[0][i] = 1;

        }
        for (int i = 0; i < m; i++)
        {
            dp[i][0] = 1;

        }
        for (int i = 1; i < m; i++)
        {
            for (int j = 1; j < n; j++)
            {
                if (i - 1 >= 0) dp[i][j] += dp[i - 1][j];
                if (j - 1 >= 0) dp[i][j] += dp[i][j - 1];
            }
        }
        return dp[m - 1][n - 1];
    }
};